The maximum size of graphs satisfying a degree condition
نویسندگان
چکیده
منابع مشابه
The maximum size of graphs satisfying a degree condition
Qiu, Y. and X.F. Jia, The maximum size of graphs satisfying a degree condition, Discrete Mathematics 104 (1992) 201-204. Let G be a simple graph of order n without isolated vertices. If the integer h satisfies ha max “E”(G) UZ!T.&, (deg, n) i then G is called an Sj(h)-graph. In this note the maximum size of Sri(h)--graphs is determined. A result of Krol and Veldman on critically h-connected gra...
متن کاملGroup connectivity of graphs satisfying Ore-condition
In this paper, we show that a simple graph G satisfying Ore-condition with |V (G)| ≥ 3 is A-connected if and only if G is not a 4-cycle, where A is an abelian group of order at least 4.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملOn graphs satisfying a local ore-type condition
For an integer i, a graph is called an Li-graph if, for each triple of vertices u, v, w with d(u, v) = 2 and w ∈ N(u) ∩N(v), d(u) + d(v) ≥ |N(u) ∪N(v) ∪N(w)| − i. Asratian and Khachatrian proved that connected L0-graphs of order at least 3 are hamiltonian, thus improving Ore’s Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-complete problem. The fo...
متن کاملThe maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90335-d